Papers by Soon Chan Kwon
Online Infix Probability Computation for Probabilistic Finite Automata (P19-1)
Copied to clipboard
| Challenge: | Probabilistic finite automata (PFAs) are statistical language models used in natural language processing. |
| Approach: | They develop an asymptotic algorithm to compute the infix probabilities of each prefix of a string from streaming data. |
| Outcome: | The proposed algorithm improves the infix probabilities of a weighted automata from streaming data. |
Incremental Computation of Infix Probabilities for Probabilistic Finite Automata (D18-1)
Copied to clipboard
| Challenge: | Probabilistic finite automata are used to model distributions in natural language processing . a method that computes infix probabilities incrementally is proposed . |
| Approach: | They propose a method that computes infix probabilities incrementally for probabilistic finite automata . they propose to represent all the probabilities of matching strings as a series of transition matrix calculations . |
| Outcome: | The proposed method is theoretically faster than the previous method and better in practice. |